Lagrangian Relaxation and Tabu Search Approaches for the Unit Commitment Problem
نویسندگان
چکیده
The paper deals with the solution of the optimal short-term unit commitment (UC) problem in an electric power system. The optimization model takes into account the main operating constraints and physical characteristics of the power generation system. A comparison between Lagrangian heuristics and Tabu Search techniques on different classes of realistic instances is presented. Such a comparison is aimed at highlighting the strong features and the weaknesses of each technique, in view of their application in computer models for competitive electricity markets in progressive evolution. The comparison may provide insights for the construction of hybrid techniques that incorporate the best of both approaches.
منابع مشابه
Lagrangian Relaxation Method for the Step fixed-charge Transportation Problem
In this paper, a step fixed charge transportation problem is developed where the products are sent from the sources to the destinations in existence of both unit and step fixed-charges. The proposed model determines the amount of products in the existing routes with the aim of minimizing the total cost (sum of unit and step fixed-charges) to satisfy the demand of each customer. As the problem i...
متن کاملThe quadratic minimum spanning tree problem: A lower bounding procedure and an efficient search algorithm
In this work we address the Quadratic Minimum Spanning Tree Problem (QMSTP) known to be NP-hard. Given a complete graph, the QMSTP consists of determining a minimum spanning tree (MST) considering interaction costs between pairs of edges to be modelled. A Lagrangian relaxation procedure is devised and an efficient local search algorithm with tabu thresholding is developed. Computational experim...
متن کاملAcceleration of Lagrangian Method for the Vehicle Routing Problem with Time Windows
The analytic center cutting plane method (ACCPM) is one of successful methods to solve nondifferentiable optimization problems. In this paper ACCPM is used for the first time in the vehicle routing problem with time windows (VRPTW) to accelerate lagrangian relaxation procedure for the problem. At first the basic cutting plane algorithm and its relationship with column generation method is clari...
متن کاملSolving the Multi-depot Location- Routing Problem with Lagrangian Relaxation
Multi-depot Location-Routing Problem (MDLRP) is about finding the optimal number and locations of depots while allocating customers to depots and determining vehicle routes to visit all customers. In this study we propose a nested Lagrangian relaxation-based method for the discrete uncapacitated MDLRP. An outer Lagrangian relaxation embedded in subgradient optimization decomposes the parent pro...
متن کاملAn Improved Modified Tabu Search Algorithm to Solve the Vehicle Routing Problem with Simultaneous Pickup and Delivery
The vehicle routing problem with simultaneous pickup and delivery (VRPSPD) is a well-known combinatorial optimization problem which addresses provided service to a set of customers using a homogeneous fleet of capacitated vehicles. The objective is to minimize the distance traveled. The VRPSPD is an NP-hard combinatorial optimization problem. Therefore, practical large-scale instances of VR...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001